Domain Decomposition Evolutionary Algorithm for Multi-Modal Function Optimization
نویسندگان
چکیده
The Simple Genetic Algorithm (SGA) is applied more and more extensively since it was proposed by J. H. Holland [1] in 1970’s. SGA is an optimization method based on population by emulating the evolvement disciplinarian of the nature. It has showed the great advantage of quick search for optimal solutions while applied in the optimization of single-modal functions. But as we all know many problems in reality belong to the optimization of multi-modal function, and if SGA is applied to solve this kind of problems, it has the confliction between the search space and convergence speed: the expansion of search space will slow down the convergence speed and the acceleration of convergence speed will reduce the search space, lead to early convergence and as a result stop research at some local optimal solutions. Evolutionary algorithms have been used regularly to solve multi-modal function optimization problems, due to their population-based approach and their inherent parallelism, e.g. a crowding factor model proposed by De Jong[2], a shared-function model proposed by Goldberg and Richardson[3], an artificial immune system method, a split ring parallel evolutionary algorithm, etc., all of which have attempted to maintain the diversity of the population during the process of evolution. In this chapter, we introduce a new ‘Domain Decomposition Evolutionary algorithm (called DDEA) which can solve not only simple nonlinear programming problems effectively and efficiently, but can also find the multiple solutions of multi-modal problems in a single run. The DDEA employs dual strategy approach that searches at two levels of detail (namely global then local). In the first (global) step, a Self-adaptive Mutations with Multi-parent Crossover Evolutionary Algorithm (SMMCEA)[4] is employed to perform a global search to divide the (chromosome) population into several subpopulations or niches in subdomains, which is domain decomposition. In the second (local) step, an evolutionary strategy-like algorithm is employed to perform a local search on each isolated niche independently. Then the best solutions of the multi-modal problem are exploited. The remainder of the chapter is organized as follows. Section 2 introduces a Self-adaptive Mutations with Multi-parent Crossover Evolutionary Algorithm (SMMCEA); Section 3 introduces Domain Decomposition evolutionary algorithm (DDEA); Section 4 presents the successful results of applying DDEA to several challenging numerical multi-modal optimization problems; Section 5 concludes. O pe n A cc es s D at ab as e w w w .ite ch on lin e. co m
منابع مشابه
Updating finite element model using frequency domain decomposition method and bees algorithm
The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...
متن کاملA MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM USING DECOMPOSITION (MOEA/D) AND ITS APPLICATION IN MULTIPURPOSE MULTI-RESERVOIR OPERATIONS
This paper presents a Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) for the optimal operation of a complex multipurpose and multi-reservoir system. Firstly, MOEA/D decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems and optimizes them simultaneously. It uses information of its several neighboring sub-problems for optimizin...
متن کاملMulti-objective optimization design of plate-fin heat sinks using an Evolutionary Algorithm Based On Decomposition
This article has no abstract.
متن کاملGENERALIZED FLEXIBILITY-BASED MODEL UPDATING APPROACH VIA DEMOCRATIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR STRUCTURAL DAMAGE PROGNOSIS
This paper presents a new model updating approach for structural damage localization and quantification. Based on the Modal Assurance Criterion (MAC), a new damage-sensitive cost function is introduced by employing the main diagonal and anti-diagonal members of the calculated Generalized Flexibility Matrix (GFM) for the monitored structure and its analytical model. Then, ...
متن کاملSolving Multi-objective Optimal Control Problems of chemical processes using Hybrid Evolutionary Algorithm
Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. This paper applies an evolutionary optimization scheme, inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...
متن کامل